Cayley graphs of finitely generated groups

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cayley graphs of finitely generated groups

There does not exist a Borel choice of generators for each finitely generated group which has the property that isomorphic groups are assigned isomorphic Cayley graphs.

متن کامل

Neighbourhood Graphs of Cayley Graphs for Finitely-generated Groups

In this short note the neighbourhood graph of a Cayley graph is considered. It has as nodes a symmetric generating set of a finitely-generated group Γ. Two nodes are connected by an edge if one is obtained from the other by multiplication on the right by one of the generators. Two necessary conditions on the graphs are shown. One is a condition on the degrees of the graph, the other concerns co...

متن کامل

Which Finitely Generated Abelian Groups Admit Isomorphic Cayley Graphs?

We show that Cayley graphs of finitely generated Abelian groups are rather rigid. As a consequence we obtain that two finitely generated Abelian groups admit isomorphic Cayley graphs if and only if they have the same rank and their torsion parts have the same cardinality. The proof uses only elementary arguments and is formulated in a geometric language.

متن کامل

Rotational Cayley Graphs on Transposition Generated Groups

As it is introduced by Bermond, Kodate, and Prennes, some Cayley graphs, including most popular models for interconnection networks, admit a special auto-morphism, called complete rotation. Such an automorphism is often used to derive algorithms or properties of the underlying graph. For example, optimal gossiping algorithms can be easily designed, and the constructions of the best known edge d...

متن کامل

No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups

A no-hole 2-distant coloring of a graph is an assignment c of nonnegative integers to the vertices of such that |c(v)−c(w)| 2 for any two adjacent vertices v and w, and the integers used are consecutive. Whenever such a coloring exists, define nsp( ) to be the minimum difference (over all c) between the largest and smallest integers used. In this paper we study the no-hole 2-distant coloring pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 2005

ISSN: 0002-9939,1088-6826

DOI: 10.1090/s0002-9939-05-07987-6